|
In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.〔 The Frucht graph is a Halin graph with chromatic number 3, chromatic index 3, radius 3, diameter 4 and girth 3. As with every Halin graph, the Frucht graph is planar, 3-vertex-connected, and polyhedral. It is also a 3-edge-connected graph. Its independence number is 5. The Frucht graph is Hamiltonian and can be constructed from the LCF notation: (). ==Algebraic properties== The Frucht graph is one of the two smallest cubic graphs possessing only a single graph automorphism, the identity〔Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990〕 (that is, every vertex can be distinguished topologically from every other vertex). Such graphs are called asymmetric (or identity) graphs. Frucht's theorem states that any group can be realized as the group of symmetries of a graph,〔.〕 and a strengthening of this theorem also due to Frucht states that any group can be realized as the symmetries of a 3-regular graph;〔.〕 the Frucht graph provides an example of this realization for the trivial group. The characteristic polynomial of the Frucht graph is . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Frucht graph」の詳細全文を読む スポンサード リンク
|